Euclid Calma Radio Link Frequency Assignment Project Report 2.2.1: Implementation and Testing of Polyhedral Techniques and Interior Point Methods

نویسندگان

  • K I Aardal
  • A Hipolito
  • C P M Van
  • Hoesel B Jansen
  • C Roos
  • T Terlaky
چکیده

1 Object Many military decisions can be formulated as combinatorial optimization problems. Such examples include weapons-targets assignments, areas to military units assignments, cargo-loading, convoy routing, radio link frequency assignment, and many others. Furthermore, many of these decisions are still made by humans, often without resource to computing power and usually adhering to some crude algorithm which has evolved over many years. The past decade has witnessed both the development of many promising optimisation algorithms as well as the continuing development of computing technology to the extent that it is now feasible to solve problems of the magnitude of some real world instances, within reasonable processing time constraints. Combinatorial optimization problems can be tackled by several approaches. So far, there is general agreement on the fact that it has not yet been proved that any one of these approaches 1

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Euclid Calma Radio Link Frequency Assignment Project Technical Annex T-2.2.1.b: Combinatorial Lower Bounds for the Rlfap

We consider the radio link frequency assignment problem, and obtain lower bounds by deening appropriate relaxations of the problem. We have used the results to estimate the performance of local search methods for the radio link frequency assignment problem developed earlier. These approximation algorithms are described in the technical annex to report 2.3.3.

متن کامل

Euclid Calma Radio Link Frequency Assignment Project Technical Annex T-2.2.1 A: a Branch-and-cut Algorithm for the Frequency Assignment Problem

The frequency assignment problem (FAP) is the problem of assigning frequencies to transmission links such that no interference occurs, and such that the number of used frequencies is minimized. We present an algorithm for the FAP that employs row generation and polyhedral techniques, primal heuristics, and branch-and-bound to obtain good lower and upper bounds to a vertex packing formulation of...

متن کامل

Euclid Calma Radio Link Frequency Assignment Project

We consider two variants of the radio link frequency assignment problem. These problems arise in practice when a network of radio links has to be established. Each radio link has to be assigned a particular frequency. The interference level between the frequencies assigned to the diierent links has to be acceptable, since otherwise communication will be distorted. The frequency assignments have...

متن کامل

Euclid Calma Radio Link Frequency Assignment Project Report 2.3.3 Local Search

1 Object Many military decisions can be formulated as combinatorial optimization problems. Such examples include weapons-targets assignments, areas to military units assignments, cargo-loading, convoy routing, radio link frequency assignment, and many others. Furthermore, many of these decisions are still made by humans, often without resource to computing power and usually adhering to some cru...

متن کامل

Design and Implementation of Field Programmable Gate Array Based Baseband Processor for Passive Radio Frequency Identification Tag (TECHNICAL NOTE)

In this paper, an Ultra High Frequency (UHF) base band processor for a passive tag is presented. It proposes a Radio Frequency Identification (RFID) tag digital base band architecture which is compatible with the EPC C C2/ISO18000-6B protocol. Several design approaches such as clock gating technique, clock strobe design and clock management are used. In order to reduce the area Decimal Matrix C...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995